New Representation for Exact Real Numbers 1
نویسندگان
چکیده
We develop the theoretical foundation of a new representation of real numbers based on the innnite composition of linear fractional transformations (lft), equivalently the innnite product of matrices, with non-negative coeecients. Any rational interval in the one point compactiication of the real line, represented by the unit circle S 1 , is expressed as the image of the base interval 0; 1] under an lft. A sequence of shrinking nested intervals is then represented by an innnite product of matrices with integer coeecients such that the rst so-called sign matrix determines an interval on which the real number lies. The subsequent so-called digit matrices have non-negative integer coeecients and successively reene that interval. Based on the classiication of lft's according to their conjugacy classes and their geometric dynamics, we show that there is a canonical choice of four sign matrices which are generated by rotation of S 1 by =4. Furthermore, the ordinary signed digit representation of real numbers in a given base induces a canonical choice of digit matrices.
منابع مشابه
Lazy Algorithms for Exact Real Arithmetic
In this article we propose a new representation for the real numbers. This representation can be conveniently used to implement exact real number computation with a lazy programming languages. In fact the new representation permits the exploitation of hardware implementation of arithmetic functions without generating the granularity problem. Moreover we present a variation of the Karatsuba algo...
متن کاملA New Representation for Exact Real Numbers 1 Abbas
We develop the theoretical foundation of a new representation of real numbers based on the innnite composition of linear fractional transformations (lft), equivalently the innnite product of matrices, with non-negative coeecients. Any rational interval in the one point compactiication of the real line, represented by the unit circle S 1 , is expressed as the image of the base interval 0; 1] und...
متن کاملFrom coinductive proofs to exact real arithmetic: theory and applications
Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number computation from constructive proofs. The extracted programs construct and combine exact real number algorithms with respect to the binary signed digit representation of real numbers. The data type corresponding to the coinductive definition of continuous functions consists of...
متن کاملA New Representation for Exact Real Numbers 1
We develop the theoretical foundation of a new representation of real numbers based on the in nite composition of linear fractional transformations (lft), equivalently the in nite product of matrices, with non-negative coe cients. Any rational interval in the one point compacti cation of the real line, represented by the unit circle S1, is expressed as the image of the base interval [0;1] under...
متن کاملA Two-Layer Approach to the Computability and Complexity of Real Numbers
We present a new approach to computability of real numbers in which real functions have type-1 representations, which also includes the ability to reason about the complexity of real numbers and functions. We discuss how this allows efficient implementations of exact real numbers and also present a new real number system that is based on it.
متن کامل